Welcome![Sign In][Sign Up]
Location:
Search - backtracking TSP

Search list

[Data structs分支限界算法求解TSP问题

Description: 本程序用分支界限方法解决TSP问题,即旅行商问题.-the procedures used branch line solution to TSP, the traveling salesman problem.
Platform: | Size: 23552 | Author: chen | Hits:

[AI-NN-PRbacktrack--TSP

Description: 使用回溯法求解TSP问题,使用VC++编写。代码量挺少,不过数据较大的时候需要时间比较长,时间复杂度为O(n!)-Use backtracking to solve TSP problems, the use of VC++ Prepared. Code volume quite low, but when the need for greater data a longer period of time complexity is O (n!)
Platform: | Size: 5120 | Author: 太阳 | Hits:

[Software Engineeringdesign

Description: 回溯法,动态规划法,遗传算法求解 tsp问题(课程设计报告)-Backtracking, dynamic programming method, genetic algorithm tsp issues (curriculum design report)
Platform: | Size: 2640896 | Author: 曾亮 | Hits:

[Mathimatics-Numerical algorithmswtsf.tgz

Description: N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历 动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic programming. C calendar dynamic computing network longest shortest route. C Traveling Salesman Bound algorithm. C Knight Dijkstra shortest path algorithm for traversing the network. C
Platform: | Size: 20480 | Author: swikon | Hits:

[File Formatbacktracking-algorithm-C

Description: 这是求解VRP和TSP相关问题的回溯算法,基于C语言环境-This is a VRP and TSP solving issues related to backtracking algorithm, based on C language environment
Platform: | Size: 57344 | Author: naiyu | Hits:

[Other01knapsackproblem

Description: 回溯法解决01背包问题,是在标准C++上运行的代码,故在VC++上也能运行良好!-Backtracking to solve 01 knapsack problem is in the standard C++ code to run on, so the VC++ is also able to run well!
Platform: | Size: 1024 | Author: daisy | Hits:

[Data structsTSP

Description: 回溯法解决TSP问题,对于任何的无向图,只要存在回路均可找到,无回路也可检测出来!-Backtracking to solve TSP problem, for any undirected graph, loop as long as there can be found, no loop can be detected!
Platform: | Size: 5120 | Author: Horace | Hits:

[Software EngineeringTSP

Description: TPS旅行商。。。。用回溯的算法。。。希望对你有用-TPS traveling salesman. . . . With backtracking algorithms. . . Hope useful to you
Platform: | Size: 1024 | Author: zheng | Hits:

[Mathimatics-Numerical algorithmsthedesignofalogrithm

Description: 该资料介绍了8中算法用于解决一些TSP,背包问题,有分治法,回溯法,等-This document describes the algorithm used to solve some 8 TSP, knapsack problem, partakers treatment method, backtracking, etc.
Platform: | Size: 1016832 | Author: malijia | Hits:

[AI-NN-PRTSP

Description: 回溯算法,很好的算法,欢迎下载!性能优越,代码漂亮!-Backtracking algorithm, a good algorithm, welcome to download! Superior performance, code beautiful!
Platform: | Size: 15360 | Author: sky | Hits:

[Mathimatics-Numerical algorithmsTSPandBAGproblem

Description: 包里包含五个文件,其中ASforTSP是用蚂蚁算法解决TSP问题,Backtrack是用回溯法解决01背包问题,GAO是用遗传算法解决TSP,GreedySelector是用贪心算法解决01背包问题,MoneyChange是金额的数字与汉字的转换方案,本人作为一个学生初学编程,希望多多包涵。-Package contains five files, which ASforTSP ant algorithm to solve TSP is the problem, Backtrack 01 is backtracking to solve knapsack problem, GAO is to use genetic algorithm to solve TSP, GreedySelector 01 is greedy algorithm to solve knapsack problem, MoneyChange is the amount of digital with the Chinese characters conversion programs, I as a beginner programming students, I hope bear with me.
Platform: | Size: 10240 | Author: 梦幻 | Hits:

[AI-NN-PRalgorithmTSP

Description: 基于回溯法的TSP问题解决方案,附有TSP问题相关的c++和matlab解法资料,及工程文件(西电02105143)-Solution of TSP problem based on the backtracking with TSP problem related to c++ and matlab solution data and project files (Western Electric 02105143)
Platform: | Size: 17271808 | Author: VanillaChow | Hits:

[Data structsThe-TSP-problem

Description: The TSP problem - 旅行商问题,回溯,分支界限法解决-The TSP problem- traveling salesman problem, backtracking, branch-and-bound method to solve
Platform: | Size: 154624 | Author: wqy | Hits:

[GUI DevelopTSP

Description: 回溯算法解决TSP路径问题,找出最优路径以及堵车后的最优路径-Optimal path after backtracking algorithm to solve TSP path problem, find the optimal path, and traffic jams
Platform: | Size: 2934784 | Author: 杨丙 | Hits:

[Data structsTSP

Description: 旅行商问题(Traveling Saleman Problem,TSP)又译为旅行推销员问题、货郎担问题,简称为TSP问题,是最基本的路线问题,该问题是在寻求单一旅行者由起点出发,通过所有给定的需求点之后,最后再回到原点的最小路径成本。采用回溯法,邻点法实现,有图形界面。-TSP (Traveling Saleman Problem, TSP) also translated as traveling salesman problem, traveling salesman problem, referred to as TSP, is the most basic routing problem, the problem is the starting point in the search for single travelers departing through all the given demand points, and finally back to the origin of the minimum path costs. Using backtracking, neighbor method to achieve, a graphical interface.
Platform: | Size: 2897920 | Author: invest | Hits:

[VC/MFCTSP-(2)

Description: TSP问题即货郎担为题,本问题是用回溯法写的。-TSP traveling salesman problem that is the title of this issue is written by backtracking.
Platform: | Size: 1024 | Author: changsheng wang | Hits:

[Windows DevelopTSP-trackback

Description: 北邮算法设计与分析作业之旅行商问题回溯法求解。已通过验收。-BUPT traveling salesman problem algorithm design and analysis work of backtracking to solve. It has passed inspection.
Platform: | Size: 1024 | Author: 方欣 | Hits:

CodeBus www.codebus.net